On the monotone hook hafnian conjecture
نویسنده
چکیده
We investigate a conjecture of Haglund that asserts that certain graph polynomials have only real roots. We prove a multivariate generalization of this conjecture for the special case of threshold graphs. Résumé. Nous étudions une conjecture de Haglund qui affirme que certaines polynômes des graphes ont uniquement des racines réelles. Nous prouvons une généralisation multivariée de cette conjecture pour le cas particulier des graphes à seuil.
منابع مشابه
Some Conjectures and Open Problems on Partition Hook Lengths
Abstract. We present some conjectures and open problems on partition hook lengths, which are all motivated by known results on the subject. The conjectures are suggested by extensive experimental calculations using a computer algebra system. The first conjecture unifies two classical results on the number of standard Young tableaux and the number of pairs of standard Young tableaux of the same ...
متن کاملThe Hafnian and a Commutative Analogue of the Grassmann Algebra
A close relationship between the determinant, the pfaffian, and the Grassmann algebra is well-known. In this paper, a similar relation between the permanent, the hafnian, and a commutative analogue of the Grassmann algebra is described. Using the latter, some new properties of the hafnian are proved.
متن کاملSensitivity Conjecture and Log-Rank Conjecture for Functions with Small Alternating Numbers
The Sensitivity Conjecture and the Log-rank Conjecture are among the most important and challenging problems in concrete complexity. Incidentally, the Sensitivity Conjecture is known to hold for monotone functions, and so is the Log-rank Conjecture for f(x∧y) and f(x⊕y) with monotone functions f , where ∧ and ⊕ are bit-wise AND and XOR, respectively. In this paper, we extend these results to fu...
متن کاملPfaffians, Hafnians and Products of Real Linear Functionals
We prove pfaffian and hafnian versions of Lieb’s inequalities on determinants and permanents of positive semi-definite matrices. We use the hafnian inequality to improve the lower bound of Révész and Sarantopoulos on the norm of a product of linear functionals on a real Euclidean space (this subject is sometimes called the ‘real linear polarization constant’ problem). -
متن کاملDisproving the Single Level Conjecture
We consider the size of monotone circuits for quadratic boolean functions, that is, disjunctions of length-2 monomials. Our motivation is that a good (linear in the number of variables) lower bound on the monotone circuit size for a certain type of quadratic function would imply a good (even exponential) lower bound on the general non-monotone circuit size. To get more insight into the structur...
متن کامل